On bandwidth-2 graphs

On bandwidth-2 graphs

On the bandwidth of Mobius graphs

Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.

on the bandwidth of mobius graphs

bandwidth labelling is a well known research area in graph theory. we provide a new proof that the bandwidth of mobius ladder is 4, if it is not a $k_{4}$, and investigate the bandwidth of a wider class of mobius graphs of even strips.

Bandwidth on AT-Free Graphs

We study the classical Bandwidth problem from the viewpoint of parametrised algorithms. Given a graph G = (V,E) and a positive integer k, the Bandwidth problem asks whether there exists a bijective function β : {1, . . . , |V |} → V such that for every edge uv ∈ E, |β(u) − β(v)| ≤ k. It is known that under standard complexity assumptions, no algorithm for Bandwidth with running time of the form...

On strongly 2-multiplicative graphs

In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative